Are there interactive protocols for co-NP languages?

Are There Interactive Protocols for CO-NP Languages?

NP - sets are Co - NP - immune Relative to a

We prove that the class NP has Co-NP-immune sets and the class Co-NP has NP-immune sets relative to a random oracle.

NP - sets are Co - NP - immune Relative to aRandom

We prove that the class NP has Co-NP-immune sets relative to a random oracle. Moreover, we prove that, relative to a random oracle, there are L 2 P and NP-set L 1 L such that L 1 is Co-NP-immune and L n L 1 is NP-immune. The second theorem implies the theorem in 4] that Co-NP has NP-immune sets relative to a random oracle.

Are There Semantic Primes in Formal Languages?

This paper surveys languages used to enrich contextual information with semantic descriptions. Such descriptions can be e.g. applied to enable reasoning when collecting vast amounts of row data in domains like smart environments. In particular, we focus on the elements of the languages that make up their semantic. To do so, we compare the expressiveness of the well-known languages OWL, PDDL and...

Just How Many Languages Are There?

Optimality Theory assumes the candidate set generated for any given input is of infinite cardinality. If all of the candidates in the candidate set were potential winners (optimal candidates under some ranking), then OT would have predicted an infinite typology— there would be infinitely many possible languages. However, Samek-Lodovici and Prince (1999) have shown that in standard OT (with only...